package cn.pugle.oj.leetcode;

import cn.pugle.oj.catalog.DynamicProblem;

/**
 * see 300
 * 没写出来.
 * 耐心排序可解
 *
 * @author tzp
 * @since 2020/9/16
 */
public class LC354 implements DynamicProblem {
    public int maxEnvelopes(int[][] envelopes) {
        if (envelopes == null || envelopes.length == 0) return 0;
        int[] state = new int[envelopes.length];

        return 0;
    }

    public int compare(int[] a, int[] b) {
        if (a[0] > b[0] && a[1] > b[1]) {
            return 1;
        }
        if (a[0] < b[0] && a[1] < b[1]) {
            return -1;
        }
        return 0;
    }

    public static void main(String[] args) {
        int[][] a = {{5, 4}, {6, 4}, {6, 7}, {2, 3}};
        System.out.println(new LC354().maxEnvelopes(a));
    }
}
